Minimum Cut Model for Spoken Lecture Segmentation
نویسندگان
چکیده
We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizes the normalized cut criterion. Our approach moves beyond localized comparisons and takes into account longrange cohesion dependencies. Our results demonstrate that global analysis improves the segmentation accuracy and is robust in the presence of speech recognition errors.
منابع مشابه
A Normalized-Cut Alignment Model for Mapping Hierarchical Semantic Structures onto Spoken Documents
We propose a normalized-cut model for the problem of aligning a known hierarchical browsing structure, e.g., electronic slides of lecture recordings, with the sequential transcripts of the corresponding spoken documents, with the aim to help index and access the latter. This model optimizes a normalizedcut graph-partitioning criterion and considers local tree constraints at the same time. The e...
متن کاملLecture 17 : Maximum Flow and Minimum Cut
Last lecture we studied duality of linear programs (LP), specifically how to construct the dual, the relation between the optimum of an LP and its dual, and some duality applications. In this lecture, we will talk about another application of duality to prove one of the theorems in combinatorics so called Maximum Flow-Minimum Cut Problem. The theorem roughly says that in any graph, the value of...
متن کاملAutomatic Segmentation and Summarization of Spoken Lectures
The ever-increasing number of online lectures has created an unprecedented opportunity for distance learning. Most online lectures are presented as unstructured text, audio and/or video files which make it di cult for students to locate relevant lectures and browse through them. In this thesis, we investigated several automatic lecture segmentation and summarization algorithms. Automatic lectur...
متن کاملMinimum Cuts
1 Minimum Cuts In this lecture we will describe an algorithm that computes the minimum cut (or simply mincut) in an undirected graph. A cut is deened as follows.
متن کاملRecovery in Perturbation - Stable Maximum Cut Instances ∗
Today we continue our discussion of exact recovery under perturbation-stability assumptions. We’ll look at a different cut problem than last lecture, and this will also give us an excuse to touch on two cool and fundamental topics, metric embeddings and semidefinite programming. The Maximum Cut problem is a famous NP -hard problem. The input is an undirected graph G = (V,E), where each edge e ∈...
متن کامل